منابع مشابه
Locally polynomially bounded structures
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally definable in a fixed o-minimal and polynomially bounded reduct. As an application we show that in certain o-minimal structures definable functions are piecewise im...
متن کاملWeak Topologies on the Bounded Holomorphic Functions
Let G be a region in the complex plane such that there is a nonconstant bounded holomorphic function on G, and denote the algebra of all such functions by BH{G). Let H^{G) denote the Banach algebra that arises when BH{G) is endowed with the supremum norm. In the case where G is the unit disc D, H*>(G) has been extensively studied, mostly by a real-variables analysis of the radial boundary value...
متن کاملCluster editing with locally bounded modifications
Given an undirected graph G = (V,E) and a nonnegative integer k, the NPhard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. In this work, we study how “local degree bounds” influence the complexity of Cluster Editing and of the related Cluster Deletion problem which allows only edge deletions. We show that even for graphs ...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملCluster Editing with Locally Bounded Modifications Revisited
For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012), at cost of a marginally worse kernel size bound. We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1977
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1977.70.125